/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
inline bool judge(char c)
{
    if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'w' || c == 'y')
        return false;
    return true;
}
int main()
{
    IOS;
    string s;
    cin >> s;
    int len = s.size();
    int cnt = 0;
    int st = -1;
    for (int i = 0; i < len; i++)
    {
        if (i == 0)
        {
            if (judge(s[i]))
            {
                cnt++;
                st = 0;
            }
        }
        else
        {
            if (judge(s[i]))
            {
                if (judge(s[i - 1]))
                {
                    cnt++;
                }
                else
                {
                    cnt++;
                    st = i;
                }
            }
            else
            { //当前不是
                if (judge(s[i - 1]))
                { //前一个是
                    int en = i - 1;
                    for (int i = st; i <= en; i += 2)
                    {
                        int tp = s[i];
                        tp = (int)s[i] - (int)'a' + (int)'A';
                        s[i] = (char)tp;
                    }
                    cnt = 0;
                }
            }
        }
    }
    if (judge(s[len - 1]))
    {
        for (int i = st; i <= len - 1; i += 2)
        {
            int tp = s[i];
            tp = (int)s[i] - (int)'a' + (int)'A';
            s[i] = (char)tp;
        }
    }
    cout << s << endl;

    getchar();
    getchar();
    return 0;
}
